Fault-tolerant sorting in SIMD hypercubes
نویسندگان
چکیده
This paper conszders sortang a n SIMD hypercube nrultaprocessors En the presence o f node fazlures. The proposed algorzthm correctly sorts u p t o 2n = N keys 21) a faulty SIMD hyperrube of dtmt nsaon n containzng u p to n 1 faulty n0dt.s The proposed fault-tolerant abgonfhm employs radix sort. W P u s e a pazr of j l ood dcmensaons whach help+ t o route daia around the faulty prsocessors durtng ihe niovement of data. If all ihP key mtlues to be sorted belong l o thr runge 0 to hf 1 , horting can be accomplishrd efiriently an O(log hf* log ,I) + O(iog2h) tzrne. Index Terms SIMD, Fault-tolerant, Parallel Sorting, Radix Sort
منابع مشابه
Fault - Tolerant Sorting Algorithm on
In this paper, algorithmic fault-tolerant techniques are introduced for sorting algorithms on n-dimensional hypercube multicomputers. We propose a fault-tolerant sorting algorithm that can tolerate up n 1 faulty processors. First, we indicate that the bitonic sorting algorithm can perform sorting operations correctly on the hypercubes with one faulty processor. In order to tolerate up r n 1 fau...
متن کاملFault-Tolerant Sorting Algorithm on Hypercube Multicomputers
In this paper, algorithmic fault-tolerant techniques are introduced for sorting algorithms on n-dimensional hypercube multi-computers. We propose a fault-tolerant sorting algorithm that can tolerate up to n-1 faulty processors. Fit, we indicate that the bitouic sorting algorithm cau perform sorting operations correctly on hypercubes with one faulty processor. In order to tolerate up to rsn-1 fa...
متن کاملTolerating Faults in Injured Hypercubes Using Maximal Fault-Free Subcube-Ring
In this paper, we present a reconfiguration approach to identify the maximal fault-free s&cube-ring for tolerating faults in injured hypercubes. The fault-free subcube-ring is connected by a ring of fault-free subcubes with dilation 3. By exploiting the size of fault-free subcubes as large as possible, the maximal fault-free s&cube-ring with higher processor utilization is obtained. Using this ...
متن کاملA generalized fault-tolerant sorting algorithm on a product network
A product network defines a class of topologies that are very often used such as meshes, tori, and hypercubes, etc. This paper proposes a generalized algorithm for fault-tolerant parallel sorting in product networks. To tolerate r−1 faulty nodes, an r-dimensional product network containing faulty nodes is partitioned into a number of subgraphs such that each subgraph contains at most one fault....
متن کاملA generalized fault - tolerant sorting algorithm on a product network q
A product network defines a class of topologies that are very often used such as meshes, tori, and hypercubes, etc. This paper proposes a generalized algorithm for fault-tolerant parallel sorting in product networks. To tolerate r 1 faulty nodes, an r-dimensional product network containing faulty nodes is partitioned into a number of subgraphs such that each subgraph contains at most one fault....
متن کامل